Faster, Further and More Sustainable

New , Faster , More Controlled

Denote a point in the plane by z = (x; y) and a polynomial of nth degree in z by f(z) = P i;j0;i+jn a ij x i y j. Denote Z(f) the set of points for which f(z) = 0. It is the 2D curve represented by f(z). In this paper, we present a new approach to tting 2D curves to data in the plane (or 3D surfaces to range data) which has signiicant advantages over presently known methods. It requires conside...

Further We Travel the Faster We Go

The average travelling speed increases in a nontrivial manner with the travel distance. This leads to scaling-like relations on quite extended spatial scales, for all mobility modes taken together and also for a given mobility mode in part. We offer a wide range of experimental results, investigating and quantifying this universal effect and its measurable causes. The increasing travelling spee...

PatternHunter: faster and more sensitive homology search

MOTIVATION Genomics and proteomics studies routinely depend on homology searches based on the strategy of finding short seed matches which are then extended. The exploding genomic data growth presents a dilemma for DNA homology search techniques: increasing seed size decreases sensitivity whereas decreasing seed size slows down computation. RESULTS We present a new homology search algorithm '...

Developing More Reliable Software Faster and Cheaper

Further More on Key Wrapping

At SAC 2009, Gennaro and Halevi showed that a key wrapping scheme using a universal hash function and ECB mode (a HtECB scheme) is broken, and the security of a scheme based on a universal hash function and CBC mode (a HtCBC scheme) has been left as an open problem. In this paper, we first generalize classical notions of universal and uniform hash functions, and propose two new notions, where w...